New Distributed Offline Processing Scheme at Belle
نویسندگان
چکیده
The offline processing of the data collected by the Belle detector has been recently upgraded to cope with the excellent performance of the KEKB accelerator. The 127 fb −1 of data (120 TB on tape) collected between autumn 2003 and summer 2004 has been processed in 2 months, thanks to the high speed and stability of the new, distributed processing scheme. We present here this new processing scheme and its performance.
منابع مشابه
Computing System for the Belle Experiment
We describe the offline computing system of the Belle experiment, consisting of a computing farm with one thousand IA-32 CPUs. Up to now, the Belle experiment has accumulated more than 120 fb of data, which is the world largest BB̄ sample at the Υ(4S) energy. The data have to be processed with a single version of reconstruction software and calibration constants to perform precise measurements o...
متن کاملThe Data-aware Resource Broker a Resource Management Scheme for Data Intensive Applications
A grid is a distributed computing environment where a group of individuals and/or institutions can share computational resources. Resources that can be shared include computing cycles, data storage, software, licences and special scientific equipment. The success of grid computing will depend on the existence of grid-specific frameworks that provide core services, such as security, resource man...
متن کاملAN OPTIMAL FUZZY SLIDING MODE CONTROLLER DESIGN BASED ON PARTICLE SWARM OPTIMIZATION AND USING SCALAR SIGN FUNCTION
This paper addresses the problems caused by an inappropriate selection of sliding surface parameters in fuzzy sliding mode controllers via an optimization approach. In particular, the proposed method employs the parallel distributed compensator scheme to design the state feedback based control law. The controller gains are determined in offline mode via a linear quadratic regular. The particle ...
متن کاملCompact Distributed Data Structures for Adaptive Routing
In designing a routing scheme for a communication network it is desirable to use as short as possible paths for routing messages, while keeping the routing information stored in the processors' local memory as succinct as possible. The eeciency of a routing scheme is measured in terms of its stretch factor-the maximum ratio between the cost of a route computed by the scheme and that of a cheape...
متن کاملMemory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines
We address the problem of organizing a set T of shared data into the memory modules of a Distributed Memory Machine (DMM) in order to minimize memory access conflicts during read operations. In this paper we present a new randomized scheme that, with high probability, performs any set of r unrelated read operations on the shared data set T in O(log r + log log |T |) parallel time with no memory...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004